Schema-Guided Synthesis of Constraint Logic Programs

Schema-guided Synthesis of Constraint Logic Programs Supervisor: Pierre Flener

Towards Stepwise, Schema-Guided Synthesis of Logic Programs

We present a general strategy for stepwise, sound and progressive synthesis of logic programs from specifications by examples and properties. We particularize this to schema-guided synthesis, and state a generic synthesis theorem. We justify some design choices for the development of a particular synthesis mechanism that is guided by a Divide-and-Conquer schema, is inductive and deductive, is i...

A Unified View of Program Schemas and Proof Methods

Both proof planning and schema-guided program synthesis can be seen as a recursive problem decomposition process followed by a recursive solution composition process, with problems being either conjectures or specifications, and solutions being either tactics or programs. We thus develop a unified view of these two activities. This approach reveals an opportunity for identifying and integrating...

A Unified View of Programming Schemas and Proof Methods

The objectives of this investigation are (a) to study the similarities between proof planning and schema-guided programming (i.e., between proof methods and programming schemas), and (b) to express the latter in terms of the former, so as to be able to use any proof planner as an existing implementation platform for developing the first schema-guided developer of (standard or constraint) logic ...

Towards Stepwise, Schema-guided Synthesis of Logic Programms

We present a general strategy for stepwise, sound and progressive synthesis of logic programs from specifications by examples and properties. We particularize this to schema-guided synthesis, and state a generic synthesis theorem. We justify some design choices for the development of a particular synthesis mechanism that is guided by a Divide-and-Conquer schema, is inductive and deductive, is i...